Speed Scaling on Parallel Processors

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speed Scaling on Parallel Processors with Migration

We study the problem of scheduling a set of jobs with release dates, deadlines and processing requirements (or works), on parallel speed-scaled processors so as to minimize the total energy consumption. We consider that both preemption and migration of jobs are allowed. An exact polynomial-time algorithm has been proposed for this problem, which is based on the Ellipsoid algorithm. Here, we for...

متن کامل

Dynamic Speed & Voltage Scaling for GALS Processors

Dynamic voltage scaling (DVS) has emerged as a successful and scalable solution to deal with the growing power consumption associated with increased chip complexity. We describe two schemes that allow the extension of DVS across multiple clock domains specific to GALS out-of-order superscalar processors. One scheme addresses the issues involved in the commonly shared front end of the pipeline. ...

متن کامل

Obtaining Optimal Thresholds for Processors with Speed-Scaling

In this research we consider a processor that can operate at multiple speeds and suggest a strategy for optimal speed-scaling. While higher speeds improve latency, they also draw a lot of power. Thus we adopt a threshold-based policy that uses higher speeds under higher workload conditions, and vice versa. However, it is unclear how to select ”optimal” thresholds. For that we use a stochastic f...

متن کامل

Parallel Cfd on Commodity Processors

In recent years, the cost of microprocessors for PCs has reduced dramatically. This has led to the introduction of a new class of computing facility commonly known as Beowulf systems, in which commodity-off-the-shelf PCs and networking components are combined into a single cost-effective parallel system. We report our experiences in implementing a number of CFD codes on a 32-processor Beowulf-c...

متن کامل

Decision Trees on Parallel Processors

A framework for induction of decision trees suitable for implementation on shared-and distributed-memory multiprocessors or networks of workstations is described. The approach , called Parallel Decision Trees (PDT), overcomes limitations of equivalent serial algorithms that have been reported by several researchers, and enables the use of the very-large-scale training sets that are increasingly...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithmica

سال: 2012

ISSN: 0178-4617,1432-0541

DOI: 10.1007/s00453-012-9678-7